|
default
Data Management,
Exploration and Mining Group
Microsoft Research
One Microsoft Way
Redmond, WA 98052
Tel: (425) 706-8979
Fax: (425) 936-7329
Email: gautamd@microsoft.com
I am a researcher in the Data Management, Exploration and Mining Group at
Microsoft Research. Prior to Microsoft I have held positions at Compaq (Tandem)
Austin and the University of Memphis. I graduated with a B.Tech in computer
science from REC ROURKELA, India, and with a Ph.D. in computer science from the
University of Wisconsin, Madison.
My research interests are in the design and analysis of
algorithms that enable search and retrieval from information stores. I am
especially interested in investigating the application of techniques from
other domains (combinatorial and graph algorithms, machine learning,
statistics, and information retrieval) to the specific problems that
relational databases pose.
In particular, I am investigating the problem of
approximate answering of aggregate queries over relational databases using
sampling-based techniques. In contrast to previous sampling-based studies, we
treat the problem as an optimization problem whose goal is to minimize the error
in answering queries in the given workload. I am also involved in the problem of
integrating searching and browsing capabilities over heterogeneous data sources,
such as relational databases, document repositories and multimedia data sources.
Finally, I am interested in similarity search and retrieval problems that arise
in categorical databases (e.g. market basket databases) as well as time series
databases.
Surajit Chaudhuri, Gautam Das, and Vivek Narasayya. A Robust,
Optimization-Based Approach for Approximate Answering of Aggregate Queries.
Proceedings of ACM SIGMOD, Santa Barbara, USA. 2001.
Surajit Chaudhuri, Gautam Das, Mayur Datar, Rajeev Motwani, and Vivek Narasayya.
Overcoming Limitations of Sampling for Aggregation Queries. ICDE 2001.
Dimitrios Gunopulos and Gautam Das. Time Series Similarity Measures. KDD
2000 tutorial.
Gautam Das and Heikki Mannila. Context-Based Similarity Measures for
Categorical Databases. PKDD 2000.
Gautam Das and Michiel H. Smid. A Lower Bound for Approximating the
Geometric Minimum Weight Matching. Information Processing Letters 74(5-6):
253-255 (2000).
Gautam Das, King-Ip Lin, Heikki Mannila, Gopal Renganathan, and Padhraic
Smyth. Rule Discovery from Time Series. KDD 1998.
Gautam Das, Heikki Mannila, and Pirjo Ronkainen. Similarity of Attributes
by External Probes. KDD 1998.
Enter subhead content here
|
